Effective Invariant Theory of Permutation Groups Using Representation Theory

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner combinatorial description of the invariant ring. Computational Invariant Theory, representation theory, permutation group This is a drafty old version : full corrected text are available at : http://www.springer.com/